Reconciliation of Gene and Species Trees With Polytomies

نویسندگان

  • Yu Zheng
  • Taoyang Wu
  • Louxin Zhang
چکیده

Motivation: Millions of genes in the modern species belong to only thousands of gene families. Genes duplicate and are lost during evolution. A gene family includes instances of the same gene in different species and duplicate genes in the same species. Two genes in different species are ortholog if their common ancestor lies in the most recent common ancestor of the species. Because of complex gene evolutionary history, ortholog identification is a basic but difficult task in comparative genomics. A key method for the task is to use an explicit model of the evolutionary history of the genes being studied, called the gene (family) tree. It compares the gene tree with the evolutionary history of the species in which the genes reside, called the species tree, using the procedure known as tree reconciliation. Reconciling binary gene and specific trees is simple. However, tree reconciliation presents challenging problems when species trees are not binary in practice. Here, arbitrary gene and species tree reconciliation is studied in a binary refinement model. Results: The problem of reconciling gene and species trees is proved NP-hard when species tree is not binary even for the duplication cost. We then present the first efficient method for reconciling a nonbinary gene tree and a non-binary species tree. It attempts to find a binary refinement of the given gene and species trees that minimizes the given reconciliation cost if they are not binary. Our algorithms have been implemented into a software to support quick automated analysis of large data sets. Availability: The program, together with the source code, is available at its online server http://phylotoo.appspot.com. Contact: yu [email protected] or [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Optimal Reconciliation Algorithm for Gene Trees with Polytomies

Reconciliation is a method widely used to infer the evolutionary relationship between the members of a gene family. It consists of comparing a gene tree with a species tree, and interpreting the incongruence between the two trees as evidence of duplication and loss. In the case of binary rooted trees, linear-time algorithms have been developed for the duplication, loss, and mutation (duplicatio...

متن کامل

Algorithms for Unrooted Gene Trees with Polytomies

Gene tree reconciliation is a method to reconcile gene trees that are confounded by complex histories of gene duplications with a provided species tree. The trees involved are required to be rooted and full binary. Reconciling gene trees allows not only to identify and study such histories for gene families, but is also the base for several higher level applications including the estimation of ...

متن کامل

Reconciling Gene Trees with Apparent Polytomies

We consider the problem of reconciling gene trees with a species tree based on the widely accepted Gene Duplication model from Goodman et al. Current algorithms that solve this problem handle only binary gene trees or interpret polytomies in the gene tree as true. While in practice polytomies occur frequently, they are typically not true. Most polytomies represent unresolved evolutionary relati...

متن کامل

Testing for Polytomies in Phylogenetic Species Trees Using Quartet Frequencies

Phylogenetic species trees typically represent the speciation history as a bifurcating tree. Speciation events that simultaneously create more than two descendants, thereby creating polytomies in the phylogeny, are possible. Moreover, the inability to resolve relationships is often shown as a (soft) polytomy. Both types of polytomies have been traditionally studied in the context of gene tree r...

متن کامل

Efficient Non-Binary Gene Tree Resolution with Weighted Reconciliation Cost

Polytomies in gene trees are multifurcated nodes corresponding to unresolved parts of the tree, usually due to insufficient differentiation between sequences. Resolving a multifurcated tree has been considered by many authors, the objective function often being the number of duplications and losses reflected by the reconciliation of the resolved gene tree with a given species tree. Here, we pre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012